Computability-Theoretic Complexity of Countable Structures
نویسندگان
چکیده
منابع مشابه
Computability-theoretic complexity of countable structures
Computable model theory, also called effective or recursive model theory, studies algorithmic properties of mathematical structures, their relations, and isomorphisms. These properties can be described syntactically or semantically. One of the major tasks of computable model theory is to obtain, whenever possible, computability-theoretic versions of various classical model-theoretic notions and...
متن کاملComputability-theoretic learning complexity.
Initially discussed are some of Alan Turing's wonderfully profound and influential ideas about mind and mechanism-including regarding their connection to the main topic of the present study, which is within the field of computability-theoretic learning theory. Herein is investigated the part of this field concerned with the algorithmic, trial-and-error inference of eventually correct programs f...
متن کاملComputability theoretic classifications for classes of structures
In this paper, we survey recent work in the study of classes of structures from the viewpoint of computability theory. We consider different ways of classifying classes of structures in terms of their global properties, and see how those affect the structures inside the class. On one extreme, we have the classes that are Σ-small. These are the classes which realize only countably many ∃-types, ...
متن کاملComputability Theoretic Properties of Injection Structures
We study computability theoretic properties of computable injection structures and the complexity of isomorphisms between these structures. We prove that a computable injection structure is computably categorical if and only if it has finitely many infinite orbits. We also prove that a computable injection structure is ∆2 categorical if and only if it has finitely many orbits of type ω or finit...
متن کاملComputability of Countable Subshifts
The computability of countable subshifts and their members is examined. Results include the following. Subshifts of CantorBendixson rank one contain only eventually periodic elements. Any rank one subshift, in which every limit point is periodic, is decidable. Subshifts of rank two may contain members of arbitrary Turing degree. In contrast, effectively closed (Π 1 ) subshifts of rank two conta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Symbolic Logic
سال: 2002
ISSN: 1079-8986,1943-5894
DOI: 10.2178/bsl/1182353917